Skip to main content

Directed Steiner tree problem on a graph : models, relaxations, and algorithms


Published August 1988
Topics GRAPHS., TREES.
SHOW MORE


Title from cover

"NPS-54-88-010."

"August 1988."

AD A199 769

Includes bibliographical references (p. 22-23)

A Steiner Problem in graphs is the problem of finding a set of edges (arcs) with minimum total weight which connects a given set of nodes in an edge- weighted graph (directed or undirected). This paper develops models for the directed Steiner tree problem on graphs. New and old models are examined in terms of their amenability to solution schemes basd on Lagrangian relaxation. As a result, three algorithms are presented and their performance compared on a number of problems originally tested by Beasley (1984, 1987) in the case of undirected graphs. Keywords: Networks, Operations research. (KR)

aq/aq cc:9116 10/02/98


Publisher Monterey, California : Naval Postgraduate School
Pages 32
Language en_US
Call number a204288
Digitizing sponsor Naval Postgraduate School, Dudley Knox Library
Book contributor Naval Postgraduate School, Dudley Knox Library
Collection navalpostgraduateschoollibrary; fedlink; americana
Notes some content may be lost due to the binding of the book.

Full catalog record MARCXML

[Open Library icon]This book has an editable web page on Open Library.

Reviews

There are no reviews yet. Be the first one to write a review.
PEOPLE ALSO FOUND
Naval Postgraduate School, Dudley Knox Library
by Leventis, Constantinos P.;Poock, G. K.
52
0
0
Naval Postgraduate School, Dudley Knox Library
by Spohnholtz, Cheryl L.
46
0
0